Design of a Hybrid Quantizer with Variable Length Code
نویسندگان
چکیده
In this paper a new model for compression of Laplacian source is given. This model consists of hybrid quantizer whose output levels are coded with Golomb-Rice code. Hybrid quantizer is combination of uniform and nonuniform quantizer, and it can be considered as generalized quantizer, whose special cases are uniform and nonuniform quantizers. We propose new generalized optimal compression function for companding quantizers. Hybrid quantizer has better performances (smaller bit-rate and complexity for the same quality) than both uniform and nonuniform quantizers, because it joins their good characteristics. Also, hybrid quantizer allows great flexibility, because there are many combinations of number of levels in uniform part and in nonuniform part, which give similar quality. Each of these combinations has different bit-rate and complexity, so we have freedom to choose combination which is the most appropriate for our application, in regard to quality, bitrate and complexity. We do not have such freedom of choice when we use uniform or nonuniform quantizers. Until now, it has been thought that uniform quantizer is the most appropriate to use with lossless code, but in this paper we show that combination of hybrid quantizer and lossless code gives better performances. As lossless code we use Golomb-Rice code because it is especially suitable for Laplacian source since it gives average bit-rate very close to the entropy and it is easier for implementation than Huffman code. Golomb-Rice code is used in many modern compression standards. Our model can be used for compression of all signals with Laplacian distribution.
منابع مشابه
Design of Fixed and Adaptive Companding Quantizer with Variable-Length Codeword for Memoryless Gaussian Source
The problem we address in this paper is the design of a quantizer that in comparison to the classical fixed-rate scalar quantizers provides more sophisticated bit rate reduction while restricting the class of quantizers to be scalar. We propose a switched variable-length code (VLC) optimal companding quantizer composed of two optimal companding scalar quantizers, the inner and the outer one, bo...
متن کاملTwo-Dimensional Vector quantizer with variable Length Lossless Code for Laplacian Source
Abstract. The main aim of this paper is to apply variable length lossless code on output points of the two-dimensional vector quantizer for Laplacian source. This problem is not yet solved in the literature. In this paper two-dimensional quantizer is designed using Helmert transform and its optimization is done. New lossless code is introduced. It is very simple but very close to the ideal code...
متن کاملSoft Decision Decoding of Fixed Rate Entropy Constrained Quantizer over a Noisy Channel
Variable-length codes (e.g. Huuman codes) are commonly employed to minimize the average binary code-word length in the quantization of discrete sources. However , the eeect of error propagation limits the usefulness of variable length codes for the transmission over noisy channels. To avoid this shortcoming, one can use a xed-rate entropy constrained quantizer, limiting the propagation of error...
متن کاملA vector quantization approach to universal noiseless coding and quantization
A two-stage code is a block code in which each block of data is coded in two stages: the first stage codes the identity of a block code among a collection of codes, and the second stage codes the data using the identified code. The collection of codes may be noiseless codes, fixed-rate quantizers, or variable-rate quantizers. We take a vector quantization approach to two-stage coding, in which ...
متن کاملVariable-length constrained-storage tree-structured vector quantization
Constrained storage vector quantization, (CSVQ), introduced by Chan and Gersho (1990, 1991) allows for the stagewise design of balanced tree-structured residual vector quantization codebooks with low encoding and storage complexities. On the other hand, it has been established by Makhoul et al. (1985), Riskin et al. (1991), and by Mahesh et al. (see IEEE Trans. Inform. Theory, vol.41, p.917-30,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Fundam. Inform.
دوره 98 شماره
صفحات -
تاریخ انتشار 2010